An available-flow neural network for solving the dynamic groundwater network maximum flow problem
نویسندگان
چکیده
The normal operation of infrastructure networks such as groundwater maintains people’s life and work. Therefore, it is great significance to estimate the residual flow when these are damaged evaluate their anti-risk ability. This paper abstracts problems damage-network time-varying maximum problem (DTMFP), where arc capacity in network set a function. Since water subject electric-driven periodic changes, damage defined by some arcs or nodes doesn’t work at all. Although existing algorithms Cai-Sha can solve problem, uncertainty topology that suffers from random makes difficult for problems. which suffer algorithms. key DTMFPs find network. In this paper, we propose an available neural (AFNN) algorithm solving DTMFPs. idea AFNN determine through back-information (BINN) first, then obtain single-path (SPNN) algorithm. BINN algorithm, departure node continuously activated given time period sends waves along destination node. wave contains be activated. Utah channel impact response wireless sensor network, American north marin district New York road used confirm effectiveness proposed
منابع مشابه
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
W describe a new algorithm for computing the efficient frontier of the “bi-objective maximum-flow network-interdiction problem.” In this problem, an “interdictor” seeks to interdict (destroy) a set of arcs in a capacitated network that are Pareto-optimal with respect to two objectives, minimizing total interdiction cost and minimizing maximum flow. The algorithm identifies these solutions throu...
متن کاملCounterpropagation Neural Network for Solving Power Flow Problem
Power flow (PF) study, which is performed to determine the power system static states (voltage magnitudes and voltage angles) at each bus to find the steady state operating condition of a system, is very important and is the most frequently carried out study by power utilities for power system planning, operation and control. In this paper, a counterpropagation neural network (CPNN) is proposed...
متن کاملThe maximum flow problem of uncertain network
The maximum flow problem is one of the classic combinatorial optimization problems with many applications in electrical power systems, communication networks, computer networks and logistic networks. The goal of the problem is to find the maximum amount of flow from the source to the sink in a network. A network is called uncertain if the arc capacities of the network are uncertain variables. T...
متن کاملThe Minimum Universal Cost Flow in an Infeasible Flow Network
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
متن کاملAn Artificial Neural Network Model for Predicting the Pressure Gradient in Horizontal Oil–Water Separated Flow
In this study, a three–layer artificial neural network (ANN) model was developed to predict the pressure gradient in horizontal liquid–liquid separated flow. A total of 455 data points were collected from 13 data sources to develop the ANN model. Superficial velocities, viscosity ratio and density ratio of oil to water, and roughness and inner diameter of pipe were used as input parameters of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2023
ISSN: ['1433-7479', '1432-7643']
DOI: https://doi.org/10.1007/s00500-023-07912-8